Fixturing Hinged Polygons
نویسندگان
چکیده
We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility—which are comparable to second and first order immobility for a single object—to capture the intuitive requirement for a fixture of a chain of hinged objects; robust immobility differs from immobility in that it additionally requires insensitivity to small perturbations of contacts. We show that frictionless point contacts can immobilize any chain of polygons without parallel edges; six contacts can immobilize any chain of three such polygons. Any chain of arbitrary polygons can be immobilized with at most contacts. We also show that "! contacts suffice to robustly immobilize polygons without parallel edges, and that #
منابع مشابه
Immobilizing Hinged Polygons
We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, which are comparable to second and first order immobility for a single object [8, 7, 11, 12] robust immobility differs from immobility in that it additionally requires insensitivity to small perturbations of contacts. We sh...
متن کاملHinged Kite Mirror Dissection
Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open whether such a hinged dissection always exists. We solve a special case of this problem, by showing that any asymmetric polygon always has a hinged dissection to...
متن کاملPolyhedral Characterization of Reversible Hinged Dissections
We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection that reverses inside and outside boundaries when folding between A and B) if and only if A and B are two non-crossing nets of a common polyhedron. Furthermore, monotone hinged dissections (where all hinges rotate in the same direction when changing from A to B) correspond exactly to non-crossing ne...
متن کاملHinged Dissection of Polygons is Hard
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them, can we swing the pieces on the hinges to transform one configuration to the other? We also consider variants in which the configurations must be convex, the placement of hinges is not specified, or the configurations ...
متن کاملHinged dissections of polyominoes and polyforms
This paper shows how to hinge together a collection of polygons at vertices in such a way that a single object can be reshaped into any n-omino, for a given value of n. An n-omino is de ned generally as a connected union of n unit squares on the integer grid. Our best dissection uses 2(n 1) polygons. We generalize this result to the connected unions of nonoverlapping equal-size regular k-gons j...
متن کامل